-
1 optimum
множ. ч. optimaоптимум, наилучший вариант решения задачи, экстремумАнгло-русский универсальный дополнительный практический переводческий словарь И. Мостицкого > optimum
-
2 estimación
f- estimación a priori
- estimación aproximada
- estimación de la base imponible
- estimación de la calidad
- estimación de confiabilidad
- estimación cuantitativa
- estimación directa
- estimación económica
- estimación eficiente
- estimación estadística
- estimación de facto
- estimación inferior
- estimación por intervalo
- estimación de jure
- estimación lineal
- estimación local
- estimación por el método de regresión
- estimación óptima
- estimación de la población
- estimación pronóstica
- estimación por puntos
- estimación regular
- estimación de los resultados
- estimación del riesgo
- estimación secuencial
- estimación de la situación en el mercado
- estimación sujeta a revisión
- estimación superior
- estimación total
См. также в других словарях:
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
Vacant niche — The issue of what exactly defines a vacant niche and whether they exist in ecosystems is the subject of some considerable controversy. It is important to understand that the subject is intimately tied into a much broader debate on whether… … Wikipedia
Computer-automated design — Design Automation usually refers to electronic design automation. Extending Computer Aided Design (CAD), automated design and Computer Automated Design (CAutoD) [1][2][3] are more concerned with a broader range of applications, such as automotive … Wikipedia
Memetic algorithm — Memetic algorithms (MA) represent one of the recent growing areas of research in evolutionary computation. The term MA is now widely used as a synergy of evolutionary or any population based approach with separate individual learning or local… … Wikipedia
Tabu search — is a mathematical optimization method, belonging to the class of local search techniques. Tabu search enhances the performance of a local search method by using memory structures: once a potential solution has been determined, it is marked as… … Wikipedia
Extremal optimization — (EO) is an optimization heuristic inspired by the Bak Sneppen model of self organized criticality from the field of statistical physics. This heuristic was designed initially to address combinatorial optimization problems such as the travelling… … Wikipedia
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
Special ordered set — In discrete optimization, a special ordered set is an ordered set of variables. There are two sorts of Special Ordered Sets.Special Ordered Sets of type 1 (SOS1 or S1) are a set of variables, at most one of which can take a strictly positive… … Wikipedia
Multidisciplinary design optimization — Multi disciplinary design optimization (MDO) is a field of engineering that uses optimization methods to solve design problems incorporating a number of disciplines. As defined by Prof. Carlo Poloni, MDO is the art of finding the best compromise … Wikipedia
Metaheuristic — In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the… … Wikipedia
Dual problem — In constrained optimization, it is often possible to convert the primal problem (i.e. the original form of the optimization problem) to a dual form, which is termed a dual problem. Usually dual problem refers to the Lagrangian dual problem but… … Wikipedia
